Simulating convergence properties of BGP
نویسندگان
چکیده
We present a simple BGP simulator that is used for testing convergence properties of inter-domain routing. The discrete-event driven simulator contains a high-level abstraction model of the BGP protocol. The purpose is to perform simulations to examine the complexity of routing information exchange and to test different possible reasons for delayed convergence of BGP routing. We have simulated effects of BGP timers on convergence and compared the results with simulations done by Labovitz and Griffin. Our simulator displayed the theoretically predicted characteristics. We then tested the effects of skewed timers, split horizon and the sender side loop detection (SSLD) techniques on convergence for different network topologies. We conclude that SSLD helps to decrease the number of announcements and the convergence time. However, SSLD increases the number of withdrawals.
منابع مشابه
BGP Fast Convergence Based on Message Classification
BGP is currently the most popular inter-domain routing protocol used in the Internet, providing stable and secure interconnection schemes for operators, and has a wealth of routing control mechanisms. BGP chooses its route depending on the attribute information contained in the update messages received from its neighbors. It allows each AS to choose their own routing policy, which may result to...
متن کاملImpact of Topology on BGP Convergence
For a few decades, the Boarder Gateway Protocol (BGP) realized Internet to be robust and acceptably stable despite its overwhelming growth. Although it is a fairly simple peer to peer protocol, yet because of the scale of Internet at which BGP is deployed, it is very difficult to understand behavior of BGP. It is considered a complex task to state what trends BGP may show if different internal ...
متن کاملImproving BGP Convergence Through Consistency Assertions
This paper presents a new mechanism for improving the convergence properties of path vector routing algorithms, such as BGP. Using a route’s path information, we develop two consistency assertions for path vector routing algorithms that are used to compare similar routes and identify infeasible routes. To apply these assertions in BGP, mechanisms to signal failure/policy withdrawal, and traffic...
متن کاملGuaranteed Fault Containment and Local Stabilization in Path-vector Routing
We formulate concepts that characterize network properties in the presence of high-frequency faults, and we present CPV, a path-vector routing protocol that locally contains high-frequency faults and locally stabilizes. Local containment enables CPV to guarantee that distant nodes be unaffected by faults. Local stabilization enables CPV to stabilize the network within time depending only on the...
متن کاملBGP convergence delay after multiple simultaneous router failures: Characterization and solutions
Border Gateway Protocol (BGP) is the default routing protocol between various autonomous systems (AS) in the Internet. In the event of a failure, BGP may repeatedly withdraw routes to some destinations and advertise new ones until a stable state is reached. It has been found that the corresponding convergence delay could stretch into hundreds of seconds or more for isolated outages and can lead...
متن کامل